Dynamic task allocation models for large distributed computing systems
نویسندگان
چکیده
منابع مشابه
Dynamic Task Allocation Models for Large Distributed Computing Systems
Dynamic task allocation for distributed computing systems (DCS) is an important goal to be achieved for engineering applications. The object is to maintain maximum utilization of computing resources while ensuring job performance at the highest productive level. The process of dynamic task allocation is to allocate or reallocate jobs (or tasks) to processors in a dynamic environment so that eve...
متن کاملStatic Task Allocation in Distributed Systems Using Parallel Genetic Algorithm
Over the past two decades, PC speeds have increased from a few instructions per second to several million instructions per second. The tremendous speed of today's networks as well as the increasing need for high-performance systems has made researchers interested in parallel and distributed computing. The rapid growth of distributed systems has led to a variety of problems. Task allocation is a...
متن کاملHybrid Task Allocation Tool for Distributed Systems
This paper describes the hybrid approach to task allocation in distributed systems by using problem-solving methods of the artificial intelligence. For the static mapping the objective function is used to evaluate the optimality of the allocation of a task graph onto a processor graph. Together with our optimization method also augmented simulated annealing and heuristic move exchange methods i...
متن کاملCongress: A Dynamic Distributed Task Allocation Environment
The implementation of Annex E (Distributed Systems) of the Ada95 Language Reference Manual is discussed with a mechanism suggested for the control of distribution in order to achieve optimal use of available resources. This approach uses compile-time complexity analysis of the source to permit the dynamic allocation of tasks to processing nodes based on the assumed computational intensity. The ...
متن کاملHeuristic task assignment for distributed computing systems
This paper addresses the problem of assigning a task with precedence constraint to a dist~buted computing system. The task turnaround time incIuding communication overhead and idle time is adopted to measure the performance of task assignment. The task assignment in this paper requires one to determine not only the assignment of modules, but also the sequence of message transmission to balance ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Parallel and Distributed Systems
سال: 1995
ISSN: 1045-9219
DOI: 10.1109/71.476170